An infinity of super-Belnap logics
نویسنده
چکیده
We look at extensions (i.e., stronger logics in the same language) of the Belnap-Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap-Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterize the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical matrix. We show that the last logic of the chain is not finitely axiomatizable.
منابع مشابه
Displaying and Deciding Substructural Logics 1: Logics with Contraposition
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modi ed proof theory which more closely models relevant logics. In addition, we use this proof theory to provide decidability proofs for ...
متن کاملLogic for Two: The Semantics of Distributive Substructural Logics
This is an account of the semantics of a family of logics whose paradigm member is the relevant logic R of Anderson and Belnap. The formal semantic theory is well worn, having been discussed in the literature of such logics for over a quarter of a century. What is new here is the explication of that formal machinery in a way intended to make sense of it for those who have claimed it to be esote...
متن کاملDisplaying and Deciding Substructural Logics
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modiied proof theory which more closely models relevant logics. In addition, we use this proof theory to provide decidability proofs for ...
متن کاملDisplay logic
I formulate a Gentzen consecution calculus for an i n d e f ~ t e number of logics all mixed together, including boolean (two valued), intuitionistic, relevance, and (various) modal logics. This is accomplished by augmenting and refining the structural ideas of Gentzen (1934). The key feature of the calculus permitting control in the presence of multiple logics is this: every "positive part" of...
متن کاملElimination of Cuts in First-order Finite-valued Logics
A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledgerepresentation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 22 شماره
صفحات -
تاریخ انتشار 2012